منابع مشابه
The least k-th power non-residue
Let p be a prime number and let k ≥ 2 be an integer such that k divides p − 1. Norton proved that the least k-th power non-residue modp is at most 3.9p log p unless k = 2 and p ≡ 3 (mod 4), in which case the bound is 4.7p log p. With a combinatorial idea and a little help from computing power, we improve the upper bounds to 0.9p log p and 1.1p log p, respectively.
متن کاملTHE BURGESS INEQUALITY AND THE LEAST k-TH POWER NON-RESIDUE
The Burgess inequality is the best upper bound we have for the character sum Sχ(M,N) = ∑ M<n≤M+N χ(n). Until recently, no explicit estimates had been given for the inequality. In 2006, Booker gave an explicit estimate for quadratic characters which he used to calculate the class number of a 32-digit discriminant. McGown, used an explicit estimate to show that there are no Norm-Euclidean Galois ...
متن کاملEfficient Cryptosystems from 2 k -th Power Residue Symbols
Goldwasser and Micali (1984) highlighted the importance of randomizing the plaintext for public-key encryption and introduced the notion of semantic security. They also realized a cryptosystem meeting this security notion under the standard complexity assumption of deciding quadratic residuosity modulo a composite number. The Goldwasser-Micali cryptosystem is simple and elegant but is quite was...
متن کاملSquare root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant
p/k + 4b + c. Our proof is inspired by the so called Stepanov method, which involves bounding the size of the solution set of a system of equations by constructing a nonzero low degree auxiliary polynomial that vanishes with high multiplicity on the solution set. The proof uses basic algebra and number theory along with a determinant identity that generalizes both the Sylvester and the Vandermo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arkiv för Matematik
سال: 1974
ISSN: 0004-2080
DOI: 10.1007/bf02384758